In order to discover the structure of local community more effectively, this paper puts forward a new local community detection\nalgorithm based on minimal cluster. Most of the local community detection algorithms begin from one node. The agglomeration\nability of a single nodemust be less thanmultiple nodes, so the beginning of the community extension of the algorithm in this paper\nis no longer from the initial node only but from a node cluster containing this initial node and nodes in the cluster are relatively\ndensely connected with each other.The algorithm mainly includes two phases. First it detects the minimal cluster and then finds the\nlocal community extended from the minimal cluster. Experimental results show that the quality of the local community detected\nby our algorithmismuch better than other algorithms no matter in real networks or in simulated networks.
Loading....